e = 0 W = 1 L = -1
ee = 0 ...

we = 3
ww = 4 we = 3 wl = 2
lw = -2 le = -3 ll = -4

wee = 9
www = 13 wwe = 12 wwl = 11 wew = 10 wee = 9 wel = 8 wlw = 7 wle = 6 wll = 5
lww = -5

[w]^n = 3^(n-1) + 3^(n-2) +...+ 3^(n-n)

Excel 2003: limit 256 columns

3^100 = 5e47 (100 constraints means at least 48 decimal digits to represent)

Ruby:
10**9 is Fixnum, 10**10 is Bignum
3**18 is Fixnum, 3**19 is Bignum

A Fixnum is 4 bytes; 3**100 is 20 bytes.

Wee = 9
Lee = -9

LWW = -5		wlw = 7
LeW = -8		elw = -2

If A entails B, A's value will be less than or equal to B's value.

wel = 8
lew = -8
lee = -9

A's value being less than or equal to B's DOES NOT ensure A entails B.

Issue: entailment is a three-valued assessment of 2 ercs:
A->B, B->A, neither entails the other.
How would you wring those 3 distinct assessments out of a binary <=?

Ordinary arithmetic fails to capture Harmony of regular OT candidates
because it can only approximate STRICT DOMINATION OF ORDERING.
Ordinary arithmetic fails to capture entailment of OT ercs
because it cannot maintain independence of complete NON-ORDERING.

Why are we interested in ordinary arithmetic in the first place? Because
our computers have dedicated hardware that can perform arithmetic
operation quickly, in parallel.
